منابع مشابه
Geometric disintegration and star-shaped distributions
Geometric and stochastic representations are derived for the big class of p-generalized elliptically contoured distributions, and (generalizing Cavalieri?s and Torricelli?s method of indivisibles in a non-Euclidean sense) a geometric disintegration method is established for deriving even more general star-shaped distributions. Applications to constructing non-concentric elliptically contoured a...
متن کاملConvex and star-shaped sets associated with stable distributions
It is known that each symmetric stable distribution in Rd is related to a norm on Rd that makes Rd embeddable in Lp([0, 1]). In case of a multivariate Cauchy distribution the unit ball in this norm corresponds is the polar set to a convex set in Rd called a zonoid. This work exploits most recent advances in convex geometry in order to come up with new probabilistic results for multivariate stab...
متن کاملModelling and simulating star-shaped random sets
Lévy particles provide a flexible framework for modelling and simulating threedimensional star-shaped random sets. The radial function of a Lévy particle arises from a kernel smoothing of a Lévy basis, and is associated with an isotropic random field on the sphere. If the kernel is proportional to a von Mises–Fisher density, or uniform on a spherical cap, the correlation function of the associa...
متن کاملConvex and star-shaped sets associated with multivariate stable distributions, I: Moments and densities
It is known that each symmetric stable distribution in Rd is related to a norm on Rd that makes Rd embeddable in Lp([0, 1]). In case of a multivariate Cauchy distribution the unit ball in this norm is the polar set to a convex set in Rd called a zonoid. This work interprets general stable laws using convex or star-shaped sets and exploits recent advances in convex geometry in order to come up w...
متن کاملStar-Shaped and L-Shaped Orthogonal Drawings
An orthogonal drawing of a plane graph G is a planar drawing of G, denoted by D(G), such that each vertex of G is drawn as a point on the plane, and each edge of G is drawn as a sequence of horizontal and vertical line segments with no crossings. An orthogonal polygon P is called orthogonally convex if the intersection of any horizontal or vertical line L and P is either a single line segment o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dependence Modeling
سال: 2020
ISSN: 2300-2298
DOI: 10.1515/demo-2020-0003